A temporally abstracted Viterbi algorithm
نویسندگان
چکیده
Hierarchical problem abstraction, when applicable, may offer exponential reductions in computational complexity. Previous work on coarse-to-fine dynamic programming (CFDP) has demonstrated this possibility using state abstraction to speed up the Viterbi algorithm. In this paper, we show how to apply temporal abstraction to the Viterbi problem. Our algorithm uses bounds derived from analysis of coarse timescales to prune large parts of the state trellis at finer timescales. We demonstrate improvements of several orders of magnitude over the standard Viterbi algorithm, as well as significant speedups over CFDP, for problems whose state variables evolve at widely differing rates.
منابع مشابه
Efficient inference algorithms for near-deterministic systems
Efficient inference algorithms for near-deterministic systems by Shaunak Chatterjee Doctor of Philosophy in Computer Science University of California, Berkeley Professor Stuart Russell, Chair This thesis addresses the problem of performing probabilistic inference in stochastic systems where the probability mass is far from uniformly distributed among all possible outcomes. Such neardeterministi...
متن کاملTerminology of Combining the Sentences of Farsi Language with the Viterbi Algorithm and BI-GRAM Labeling
This paper, based on the Viterbi algorithm, selects the most likely combination of different wording from a variety of scenarios. In this regard, the Bi-gram and Unigram tags of each word, based on the letters forming the words, as well as the bigram and unigram labels After the breakdown into the composition or moment of transition from the decomposition to the combination obtained from th...
متن کاملGeneralized Baum-Welch and Viterbi Algorithms Based on the Direct Dependency among Observations
The parameters of a Hidden Markov Model (HMM) are transition and emission probabilities‎. ‎Both can be estimated using the Baum-Welch algorithm‎. ‎The process of discovering the sequence of hidden states‎, ‎given the sequence of observations‎, ‎is performed by the Viterbi algorithm‎. ‎In both Baum-Welch and Viterbi algorithms‎, ‎it is assumed that...
متن کاملImproving Phoneme Sequence Recognition using Phoneme Duration Information in DNN-HSMM
Improving phoneme recognition has attracted the attention of many researchers due to its applications in various fields of speech processing. Recent research achievements show that using deep neural network (DNN) in speech recognition systems significantly improves the performance of these systems. There are two phases in DNN-based phoneme recognition systems including training and testing. Mos...
متن کاملA Reduced-State Viterbi Algorithm for Blind Sequence Estimation of DPSK Sources
The Viterbi algorithm is the optimum decoding algorithm for convolutional codes and has often served as a standard technique in digital communication systems for maximum likelihood sequence estimation. With the Viterbi Algorithm, the computational complexity increases exponentially with the constraint length of the convolutional code. Reducing the constraint length (hence the number of states) ...
متن کامل